Quarter-Plane Lattice Paths with Interacting Boundaries: The Kreweras and Reverse Kreweras Models

نویسندگان

چکیده

Lattice paths in the quarter plane have led to a large and varied set of results recent years. One major project has been classification step sets according properties corresponding generating functions, this involved variety techniques, some highly intricate specialised. The famous Kreweras reverse walk models are two particularly interesting models, as they among only four cases which algebraic functions. Here we investigate how change when boundary interactions introduced. That is, associate three real-valued weights $a,b,c$ with visits by walks $x$-axis, $y$-axis origin $(0,0)$ respectively. These were partially solved paper Beaton, Owczarek Rechnitzer (2019). We apply kernel method completely solve these models. find that an function for all $a,b,c$, regardless whether restricted end at or on one axes, may anywhere all. For walks, returning is algebraic, but other D-finite. To our knowledge first example quarter-plane model property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Walks in the quarter plane: Kreweras’ algebraic model

We consider planar lattice walks that start from (0, 0), remain in the first quadrant i, j ≥ 0, and are made of three types of steps: North-East, West and South. These walks are known to have remarkable enumerative and probabilistic properties: – they are counted by nice numbers (Kreweras 1965), – the generating function of these numbers is algebraic (Gessel 1986), – the stationary distribution...

متن کامل

Counting Orbits Under Kreweras Complementation

The Kreweras complementation map is an anti-isomorphism on the lattice of noncrossing partitions. We consider an analogous operation for plane trees motivated by the molecular biology problem of RNA folding. In this context, we explicitly count the orbits of Kreweras’ map according to their length as the number of appropriate symmetry classes of trees in the plane. These new enumeration results...

متن کامل

Bijective counting of Kreweras walks and loopless triangulations

X iv :m at h/ 06 05 32 0v 1 [ m at h. C O ] 1 2 M ay 2 00 6 BIJECTIVE COUNTING OF KREWERAS WALKS AND LOOPLESS TRIANGULATIONS OLIVIER BERNARDI Abstra t. We onsider latti e walks in the plane starting at the origin, remaining in the rst quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain Kreweras dis overed a remarkably simple formula giving the number of these walks ...

متن کامل

Lattice and Schröder paths with periodic boundaries

We consider paths in the plane with (1, 0), (0, 1), and (a, b)-steps that start at the origin, end at height n, and stay to the left of a given non-decreasing right boundary. The fourth author was supported in part by NSF grant #DMS-0245526.

متن کامل

Lattice Paths Between Diagonal Boundaries

A bivariate symmetric backwards recursion is of the form d[m,n] = w0(d[m− 1, n]+d[m,n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m− sk, n− rk]) where ω0, . . . ωk are weights, r1, . . . rk and s1, . . . sk are positive integers. We prove three theorems about solving symmetric backwards recursions restricted to the diagonal band x+ u < y < x− l. With a solution we mean a formu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Springer proceedings in mathematics & statistics

سال: 2021

ISSN: ['2194-1009', '2194-1017']

DOI: https://doi.org/10.1007/978-3-030-84304-5_7